Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems
نویسندگان
چکیده
Let F be a family of graphs. A canonical vertex deletion problem corresponding to F is defined as follows: given an n-vertex undirected graph G and a weight function w : V (G)→ R, find a minimum weight subset S ⊆ V (G) such that G− S belongs to F . This is known as Weighted F Vertex Deletion problem. In this paper we devise a recursive scheme to obtain O(logO(1) n)-approximation algorithms for such problems, building upon the classic technique of finding balanced separators in a graph. Roughly speaking, our scheme applies to those problems, where an optimum solution S together with a well-structured set X, form a balanced separator of the input graph. In this paper, we obtain the first O(logO(1) n)approximation algorithms for the following vertex deletion problems. • We give an O(log n)-factor approximation algorithm for Weighted Chordal Vertex Deletion (WCVD), the vertex deletion problem to the family of chordal graphs. On the way to this algorithm, we also obtain a constant factor approximation algorithm for Multicut on chordal graphs. • We give an O(log n)-factor approximation algorithm for Weighted Distance Hereditary Vertex Deletion (WDHVD), also known as Weighted Rankwidth-1 Vertex Deletion (WR-1VD). This is the vertex deletion problem to the family of distance hereditary graphs, or equivalently, the family of graphs of rankwidth 1. Our methods also allow us to obtain in a clean fashion a O(log n)-approximation algorithm for the Weighted F Vertex Deletion problem when F is a minor closed family excluding at least one planar graph. For the unweighted version of the problem constant factor approximation algorithms are were known [Fomin et al., FOCS 2012], while for the weighted version considered here an O(log n log log n)-approximation algorithm follows from [Bansal et al. SODA 2017]. We believe that our recursive scheme can be applied to obtain O(logO(1) n)-approximation algorithms for many other problems as well. ∗The research leading to these results received funding from the European Research Council under the European Unions Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement no. 306992. †University of Bergen, Bergen, Norway. [email protected]. ‡University of Bergen, Bergen, Norway. [email protected]. §Institute of Mathematical Sciences, Chennai, India. [email protected]. ¶University of Bergen, Bergen, Norway. The Institute of Mathematical Sciences HBNI, Chennai, India. [email protected]. ‖University of Bergen, Bergen, Norway. [email protected]. ar X iv :1 70 7. 04 90 8v 1 [ cs .D S] 1 6 Ju l 2 01 7
منابع مشابه
Distributed Weighted Matching
In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximation ratio of the tree algorithm is constant. In particular, the approximation ratio is 4. For the general graph algorithm we prove a constant ratio bound of 5 and a polylogarithmic time complexity of O(log n).
متن کاملMaintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time
A sparse subgraph G′ of G is called a matching sparsifier if the size or weight of matching in G′ is approximately equal to the size or weight of maximum matching in G. Recently, algorithms have been developed to find matching sparsifiers in a static bipartite graph. In this paper, we show that we can find matching sparsifier even in an incremental bipartite graph. This observation leads to fol...
متن کاملOrdering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion
In this paper, we give the first polynomial time approximation algorithms for two problems in combinatorial optimization. The first problem is single-processor scheduling to minimize weighted sum of completion times, subject to precedence constraints. The second problem, interval graph completion, is finding a minimum-size interval graph containing the input graph as a subgraph. Both problems a...
متن کاملGeneralized Weighted Composition Operators From Logarithmic Bloch Type Spaces to $ n $'th Weighted Type Spaces
Let $ mathcal{H}(mathbb{D}) $ denote the space of analytic functions on the open unit disc $mathbb{D}$. For a weight $mu$ and a nonnegative integer $n$, the $n$'th weighted type space $ mathcal{W}_mu ^{(n)} $ is the space of all $fin mathcal{H}(mathbb{D}) $ such that $sup_{zin mathbb{D}}mu(z)left|f^{(n)}(z)right|begin{align*}left|f right|_{mathcal{W}_...
متن کاملApproximation algorithms for shop scheduling problems with minsum objective: A correction
We consider a general class of multiprocessor shop scheduling problems, preemptive or nonpreemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We present a general approximation method combining a linear programming relaxation in the operation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1707.04908 شماره
صفحات -
تاریخ انتشار 2017